Virginia v. Black: Hard-Core Hate Speech, Hard-Core Porn and the First Amendment
نویسندگان
چکیده
منابع مشابه
Hard-Core Distributions for Somewhat Hard Problems
Consider a decision problem that cannot be 1 ? approximated by circuits of a given size in the sense that any such circuit fails to give the correct answer on at least a fraction of instances. We show that for any such problem there is a speciic \hard-core" set of inputs which is at least a fraction of all inputs and on which no circuit of a slightly smaller size can get even a small advantage ...
متن کاملBoosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosting, a technique from computational learning theory. Using this connection we give fruitful applications of complexity-theoretic techniques to learning theory and vice versa. We show that the hard-core set construction ...
متن کاملHard Core entropy: lower bounds
We establish lower bounds for the entropy of the Hard Core Model on a few 2d lattices L. In this model the allowed configurations inside {0,1} are the one’s in which the nearest neighbor 1’s are forbidden. Our method which is based on a sequential fill-in scheme is unbiassed and thereby yields in principle arbitrarily good estimates for the topological entropy. The procedure also gives some det...
متن کاملThe Complexity of Computing Hard Core Predicates
We prove that a general family of hard core predicates requires circuits of depth (l-o(l)) ~ or super-polynomial size to be realized. This lower bound is essentially tight, l~or constant depth circuits, an exponential lower bound on the size is obtained. Assuming the existence of one-way functions, we explicitly construct a one-way function f(x) such that for any circuit c from a family of circ...
متن کاملMultisymbol Majority Vote and Hard Core
This paper describes a weak sense majority-vote technique for a k symbol function g(z) as follows. If a probabilistic polynomial time algorithm A exists such that Pr[A(z) = g(z)] 1=k + , then s 4 = 2 k 1 1 probabilistic polynomial time algorithms f ^ A 1 ; : : : ; ^ A s g exist such that for 8z 2 f0; : : : ; k 1g , there exists ^ A i 2 f ^ A 1 ; : : : ; ^ A s g such that Pr[ ^ A i (z) = g(z)] 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Good Society
سال: 2005
ISSN: 1538-9731
DOI: 10.1353/gso.2005.0028